Two-direction Poly-scale Refinement Equations with Nonnegative Coefficients
نویسندگان
چکیده
We prove that the vector space of all 1 L -solutions of the above equation is at most one-dimensional and consists of compactly supported functions of constant sign. We also show that any1 L solution of the above equation is either positive or negative on its support under a special assumption. With regard to the solutions of the equation, some simple sufficient conditions for the existence of nontrivial -solutions and the nonexistence of such solutions are given.
منابع مشابه
Subdivision Schemes and Refinement Equations with Nonnegative Masks
We consider the two-scale refinement equation f(x) = ∑N n=0 cnf(2x − n) with ∑ n c2n = ∑ n c2n+1 = 1 where c0, cN 6= 0 and the corresponding subdivision scheme. We study the convergence of the subdivision scheme and the cascade algorithm when all cn ≥ 0. It has long been conjectured that under such an assumption the subdivision algorithm converge, as well as the cascade algorithm converge unifo...
متن کاملTwo-Dimensional Elasticity Solution for Arbitrarily Supported Axially Functionally Graded Beams
First time, an analytical two-dimensional (2D) elasticity solution for arbitrarily supported axially functionally graded (FG) beam is developed. Linear gradation of the material property along the axis of the beam is considered. Using the strain displacement and constitutive relations, governing partial differential equations (PDEs) is obtained by employing Ressiner mixed var...
متن کاملUniform exponential stability of first-order dynamic equations with several delays
Keywords: Differential equations Difference equations Stability Bohl–Perron theorem Linear delay dynamic equations Time scales Uniform exponential stability a b s t r a c t This paper is concerned with the uniform exponential stability of ordinary and delay dynamic equations. After revealing the equivalence between various types of uniform exponential stability definitions on time scales with b...
متن کاملAggregation of nonnegative integer-valued equations
Results are given for aggregating a system of nonnegative integer equations of the form Xj = bj, je N, to yield a single equivalent equation whose coefficients correspond to those of the best previously known result for the special case b, = 1, jc,V. Different aggregations are obtained for different permutations of the indexes jEIV, according to the sizes of the b, values, and we also identify ...
متن کاملWeisfeiler-Leman meets Homomorphisms
In this paper, we relate a beautiful theory by Lovász with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman algorithm. We prove that two graphsG andH are indistinguishable by the color refinement algorithm if and only if, for all trees T , the number Hom(T,G) of homomorphisms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011